MRL and SuperFine+MRL: new supertree methods
نویسندگان
چکیده
منابع مشابه
Polynomial Supertree Methods Revisited
Supertree methods allow to reconstruct large phylogenetic trees by combining smaller trees with overlapping leaf sets into one, more comprehensive supertree. The most commonly used supertree method, matrix representation with parsimony (MRP), produces accurate supertrees but is rather slow due to the underlying hard optimization problem. In this paper, we present an extensive simulation study c...
متن کاملPolynomial Supertree Methods in Phylogenomics
One of the objectives in modern biology, especially phylogenetics, is to build larger clades of the Tree of Life. Large-scale phylogenetic analysis involves several serious challenges. The aim of this thesis is to contribute to some of the open problems in this context: Perhaps most important in general is the design of fast and efficient algorithms to reconstruct large phylogenetic trees. In o...
متن کاملPerformance study of supertree methods
INTRODUCTION Phylogenetic trees depict the relationships among varying species [1]. A simple example of this is a family tree. When referring to Figure 1, the three most important components of a tree include: the Node(s) (denoted by squares), the Branches (denoted by lines), and the Tips (denoted by circles). The Nodes represent the hypothetical ancestors. The Branches represent the evolution ...
متن کاملon the comparison of keyword and semantic-context methods of learning new vocabulary meaning
the rationale behind the present study is that particular learning strategies produce more effective results when applied together. the present study tried to investigate the efficiency of the semantic-context strategy alone with a technique called, keyword method. to clarify the point, the current study seeked to find answer to the following question: are the keyword and semantic-context metho...
15 صفحه اولExtending the Limits of Supertree Methods
Recently, two exact polynomial-time supertree methods have been developed in which the traditional input of rooted leaf-labelled trees has been extended in two separate ways. The first method, called RankedTree, allows for the inclusion of relative divergence dates and the second method, called AncestralBuild, allows for the inclusion of rooted trees in which some of the interior vertices as we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms for Molecular Biology
سال: 2012
ISSN: 1748-7188
DOI: 10.1186/1748-7188-7-3